搜索资源列表
tree
- 根据prim算法编写的求一棵树的最小生成树的程序。-Prepared in accordance with prim algorithm for a tree of minimum spanning tree procedure.
Prim
- 这是一个构造最小生成树的Prim算法，是属于贪心算法的范畴。设G=(V,E)是连同带权图，V={1，2，3，...，n}。构造G的最小生成树。-This is a structure of Prim minimum spanning tree algorithm is a greedy algorithm category. Set G = (V, E) is, together with the weighted graph, V = (1,2,3 ,..., n). G of the min
f.doc
- 题目1：图的建立与遍历；连通网的最小生成树生成实现。 内容： 1） 用邻接表表示方法建立图1所示图的存储结构，用邻接矩阵存表示方法建立图2所示网的存储结构。 2） 在图1 存储结构（邻接表）上实现深度优先搜索遍历和广度优先搜索遍历，并给出遍历结果（序列）。 3） 按照普里姆算法，在图2所示连通网的存储结构（邻接矩阵）上实现此网的最小生成树，并输出生成树。 -Title 1: Map of the establishment and ergodicity conne
GZ
- 给定一个地区的n个城市间的距离网，用Prim算法或Kruskal算法建立最小生成树，并计算得到的最小生成树的代价。-Given a region n the distance between cities network, using Prim algorithm or Kruskal minimum spanning tree algorithm, and calculate the cost of the minimum spanning tree.
prim
- 本源码可供数据结构的初学者借鉴，叫最小生成树prim算法-The source for the data structure from the beginners, called minimum spanning tree algorithm prim
Primalgorithm
- 普里姆算法求最小生成树(邻接表存储)，用c++描写的，数据结构中的-Prim algorithm for minimum spanning tree (adjacent table storage), with c++ descr iption, data structure
ALGO-11
- Prim algorithm to find shortest path in graph
prim
- 数据结构中的最小生成树实现，根据核心算法在Visual studio6.0的开发环境中运行成功。-Data structure to achieve the minimum spanning tree, according to the core algorithm in the development environment Visual studio6.0 run successfully.
prim
- prim算法构造最小生成树，调试通过，c++语言编写。-Minimum Spanning Tree Algorithm prim, debugging through, c++ languages.
B
- Prim算法完整实现代码收藏 用Prim算法求无向图的最小生成树 -Prim algorithm to achieve a complete collection of code using Prim algorithm for undirected graph of the minimum spanning tree
222222222222
- 1． 利用克鲁斯卡尔算法求网的最小生成树。 2． 利用普里姆算法求网的最小生成树。 3． 要求输出各条边及它们的权值。 -1. Using Kruskal' s algorithm for minimum spanning tree network. 2. Prim algorithm for the use of the minimum spanning tree network. 3. Requirements of the output of each side, and
prim
- Prim s algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the
MST
- Minimum Spanning Tree implementation using kruskal and prims algorithm.
PRIM
- 构造最小生成树的常用方法是Prim算法与Kruskal算法，二者都是基于贪心算法设计侧略。-Construction of the commonly used minimum spanning tree algorithm is Prim and Kruskal algorithms, both are based on the design side of a little greedy algorithm.
a
- 最小生成树C语言描述，采用了Prim算法，提高程序运行速度-C language to describe the minimum spanning tree, using Prim algorithm, improve the running speed
Prims_Algorithm
- Prim s algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the
PRIM
- prim s algorithm implementation in C++ with graphical output
prim
- 依据prim最小生成树的算法实现的最小生成树源码，能够建立准确的最小代价生成树-Prim minimum spanning tree based on the minimum spanning tree algorithm source code, be able to establish an accurate minimum cost spanning tree
091017prim
- 用prim算法求最小生成树.C语言中关于图一章的很好的理解例子。对初学者很有用。-Seek the minimum spanning tree with the prim algorithm. C language on the map a good understanding of the chapter examples. Very useful for beginners.
2485
- pku 2485 use the prim algorithm